skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Aktas, Mehmet Fatih"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, IEEE Transactions on Communications)
    Full Text Available 
  2. ; ; ; (, IEEE Transactions on Information Theory)
    Full Text Available 
  3. ; (, IEEE/ACM Transactions on Networking)
    null (Ed.)
    Full Text Available 
  4. ; (, 2019 IEEE Information Theory Workshop (ITW'19))
    null (Ed.)
    Full Text Available 
  5. ; (, CodML (Workshop of ICML))
    Accepted Manuscript Full Text Available
  6. ; ; (, 2019 XVI International Symposium" Problems of Redundancy in Information and Control Systems"(REDUNDANCY))
    null (Ed.)
    Full Text Available 
  7. ; (, 2018 IEEE International Symposium on Information Theory (ISIT))
    There has been a growing interest, in both theory and practice, in using the available redundancy in storage systems for mitigating stragglers in content download. This paper is concerned with MDS coded storage systems and studies (n, k) data access model. When k = n, system is equivalent to a fork-join queue, which is known to be notoriously hard to analyze, while system with k = 1 has been previously shown to be equivalent to an M/G/1 queue. We here argue that the system with k = 2 is of practical interest, and then present a method that approximates the system as an M/G/1 queue. Approximated download time is shown to be more accurate than the bounds available in the literature. We also note that the presented method can be used for approximating systems that employ other newly designed and deployed storage codes. 
    more » « less
    Full Text Available